bin packing中文是什么意思

• 装箱问题

• "bin"中文翻译    n. 1.(放五谷、煤炭等的)有盖大箱。 2.〔英国〕收 ...
• "packing"中文翻译    n. 1.包装，打包，打行李，包扎；包装材料，包装用品； ...
• "packing bin" 中文翻译 :    装包粉仓
• "bin" 中文翻译 :    n. 1.(放五谷、煤炭等的)有盖大箱。 2.〔英国〕收采酒花的帆布袋。 3.(地下室)葡萄酒贮藏库。 4.垃圾箱。 5.〔口语〕精神病院。 6.〔英口〕裤子口袋。 a rubbish [dust] bin 垃圾箱。 vt. (-nn-) 把…装进贮藏库[大木箱]。
• "bin-" 中文翻译 :    comb. f. 〔用于母音前〕 ＝ bi-: binaural.
• "packing" 中文翻译 :    n. 1.包装，打包，打行李，包扎；包装材料，包装用品；包装法。 2.(缝隙)填料〔旧棉絮等〕。 3.〔美国〕食品加工业；罐头业。 4.【机械工程】衬垫；【建筑】灌筑。 5.(电视)图象压缩。 6.〔美国〕兵士的口粮；食物。 7.【医学】包扎法；塞法。 8.集合。 a packing mat 草包。 the packing industry 〔美国〕食品加工业；罐头工业。
• "bin-bin dong" 中文翻译 :    董斌斌
• "bin-bin huang" 中文翻译 :    黄彬彬
• "bin-bin li" 中文翻译 :    李彬彬
• "bin-bin lin" 中文翻译 :    林宾宾
• "bin-bin liu" 中文翻译 :    者 刘彬彬
• "bin-bin zhang" 中文翻译 :    张彬彬
• "proportioning bin, stock bin" 中文翻译 :    配料仓
• "yousef bin omeir bin" 中文翻译 :    yousef优素福本奥马尔本优素福
• "packing cloth packing canvas" 中文翻译 :    包装用的粗麻布
• "packing cloth,packing canvas" 中文翻译 :    包装用的粗麻布
• "sound packing undamaged packing" 中文翻译 :    未损坏的包装
• "feed bin; bunker; stock bin; storage bin" 中文翻译 :    料仓
• "additive bin" 中文翻译 :    加料仓
• "ageing bin" 中文翻译 :    调湿仓
• "aggregate bin" 中文翻译 :    骨料仓; 集料斗
• "ambulatory bin" 中文翻译 :    活动料槽; 移动式料仓
• "anyang bin" 中文翻译 :    anyang安阳斌
• "ash bin" 中文翻译 :    灰包垃圾桶; 灰仓; 垃圾箱; 煤灰桶
• "ash-bin" 中文翻译 :    垃圾桶，煤灰桶。

• On - line algorithms for the constrained bin packing problem
  一类带约束的装箱问题的在线算法
• The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete )
  装箱问题是具有最高计算复杂性的一类问题： npc ( nondeterministicpolynomialcomplete非确定型多项式算法)类问题。
• A variation of one - dimensional bin packing problem : the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed
  摘要文章介绍一维装箱问题的一个衍生问题：最小基数箱子覆盖问题和它的一个启发式算法。
• In this paper , we study an on - line version of the two - dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit - square bins in an on - line manner . an on - line algorithm called rtdh ( refined two dimensional harmonic ) is proposed and analyzed . we show that rtdh can achieve an asymptotic worst - case ratio of less than 2 . 7687 , which beats the best - known bound 2 . 85958
  目前，对该问题的研究有各种算法，主要有harmonic和round算法，本文针对harmonic和round算法存在的问题，提出一种算法rtdh ( refinedtwodimensionalharmonic ) ，做了相应的分析，并且给出了该算法的最坏性能比是2 . 7687的证明，这个结果刷新了目前最好的结果2 . 85958 。
• In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems , one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio , another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan , we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1 . 6
  第一个算法利用装箱问题中的ff ( firstfit )算法求解极大化按期完工工件数的平行机排序问题pm d _ j = d n - u _ j ，该近似算法具有渐近性能比下界。第二个近似算法利用二维装箱中strippacking问题的算法求解以极小化makespan为目标的带并行工件的平行机排序问题，该算法的渐近性能比具有下界1 . 5和上界1 . 6 。
• In chapter 3 , two novel scheduling algorithms are put forward to supporting qos according to bin packing problem . bhps arriving are sent to different queues according to their outport , in each ourport queue , bhps are classified by their priorities and scheduled as a batch . the simulation results shows that ffd and bfd not only can provide qos effectively , but also can improve the average loss function
  通过该调度算法,可以实现高优先级突发对低优先级的抢占,提供服务质量支持,并利用openet仿真软件对这两种调度算法进行仿真。仿真结果表明,基于装箱问题的ffd和bfd调度算法不仅能提供有效的qos支持,还能改善系统总体的丢失性能。